On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity in Computational Geometry
نویسنده
چکیده
Point location problems for n points in d-dimensional Euclidean space (and lp spaces more generally) have typically had two kinds of running-time solutions: (Nearly-Linear) less than d ·n log n time, or (Barely-Subquadratic) f (d) ·n2−1/Θ(d) time, for various functions f . For small d and large n, “nearly-linear” running times are generally feasible, while the “barelysubquadratic” times are generally infeasible, requiring essentially quadratic time. For example, in the Euclidean metric, finding a Closest Pair among n points in R is nearly-linear, solvable in 2 ·n log n time, while the known algorithms for finding a Furthest Pair (the diameter of the point set) are only barely-subquadratic, requiring Ω(n2−1/Θ(d)) time. Why do these proximity problems have such different time complexities? Is there a barrier to obtaining nearly-linear algorithms for problems which are currently only barely-subquadratic? We give a novel exact and deterministic self-reduction for the Orthogonal Vectors problem on n vectors in {0,1}d to n vectors in Zω(logd) that runs in 2o(d) time. As a consequence, barely-subquadratic problems such as Euclidean diameter, Euclidean bichromatic closest pair, ray shooting, and incidence detection do not have O(n2−ε) time algorithms (in Turing models of computation) for dimensionality d = ω(log logn), unless the popular Orthogonal Vectors Conjecture and the Strong Exponential Time Hypothesis are false. That is, while the poly-log-log-dimensional case of Closest Pair is solvable in n1+o(1) time, the poly-log-log-dimensional case of Furthest Pair can encode difficult large-dimensional problems conjectured to require n2−o(1) time. We also show that the All-Nearest Neighbors problem in ω(logn) dimensions requires n2−o(1) time to solve, assuming either of the above conjectures. MIT CSAIL & EECS, [email protected]. Supported by an NSF CAREER award.
منابع مشابه
On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity
Point location problems for n points in d-dimensional Euclidean space (and `p spaces more generally) have typically had two kinds of running-time solutions: (Nearly-Linear) less than d · n log n time, or (Barely-Subquadratic) f(d) ·n2−1/Θ(d) time, for various f . For small d and large n, “nearly-linear” running times are generally feasible, while the “barely-subquadratic” times are generally in...
متن کاملApplication of the Schwarz-Christoffel Transformation in Solving Two-Dimensional Turbulent Flows in Complex Geometries
In this paper, two-dimensional turbulent flows in different and complex geometries are simulated by using an accurate grid generation method. In order to analyze the fluid flow, numerical solution of the continuity and Navier-Stokes equations are solved using CFD techniques. Considering the complexity of the physical geometry, conformal mapping is used to generate an orthogonal grid by means of...
متن کاملStrong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation
We present an efficient proof system for MULTIPOINT ARITHMETIC CIRCUIT EVALUATION: for any arithmetic circuit C(x1, . . . ,xn) of size s and degree d over a field F, and any inputs a1, . . . ,aK ∈ Fn, • the Prover sends the Verifier the values C(a1), . . . ,C(aK) ∈ F and a proof of Õ(K ·d) length, and • the Verifier tosses poly(log(dK|F|/ε)) coins and can check the proof in about Õ(K · (n+d)+ s...
متن کاملOn the Computational Complexity of Optimal Multisplitting
The need to partition or discretize numeric value ranges arises in machine learning and data mining algorithms. This subtask is a potential time-consumption bottleneck, since the number of candidate partitions is exponential in the number of possible cut points in the range. Thus, many heuristic algorithms have been proposed for this task. Recently, the eeciency of optimal multisplitting has im...
متن کاملThe Impact of Mediational Artifact Types on EFL Learners’ Writing Complexity: Collaboration vs. Asynchronous Artifacts
The present study was an attempt to investigate the significance of environmental changes on the develo p- ment of writing in English as a Foreign Language (EFL) context with respect to the individual. This study also compared the impacts of collaboration and asynchronous computer mediation (ACM) on the writing complexity of EFL learners. To this end, three intact writing classes were designate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1709.05282 شماره
صفحات -
تاریخ انتشار 2017